Nondeterministic bounded query reducibilities
نویسندگان
چکیده
منابع مشابه
Deficiency Sets and Bounded Information Reducibilities
For recursively enumerable sets A and H of natural numbers H is a deficiency set of A if there is a one-one, recursive function / with A = Rng(/) and H = {í: (3/)[i < / & f(j) < /(/)]}. The relation between recursively enumerable sets and their deficiency sets under bounded information reducibilities (i.e. weak truth table, truth table, bounded truth table, many-one, and one-one reducibility) i...
متن کاملLattice Embeddings for Abstract Bounded Reducibilities
We give an abstract account of resource-bounded reducibilities as exemplified by the polynomially timeor logarithmically space-bounded reducibilities of Turing, truth-table, and many-one type. We introduce a small set of axioms that are satisfied for most of the specific resourcebounded reducibilities appearing in the literature. Some of the axioms are of a more algebraic nature, such as the re...
متن کاملNondeterministic Query Algorithms
Query algorithms are used to compute Boolean functions. The definition of the function is known, but input is hidden in a black box. The aim is to compute the function value using as few queries to the black box as possible. As in other computational models, different kinds of query algorithms are possible: deterministic, probabilistic, as well as nondeterministic. In this paper, we present a n...
متن کاملStrongly Bounded Turing Reducibilities and Computably Enumerable Sets
Preface In this course we survey some recent work on the strongly bounded Turing re-ducibilities on the computably enumerable sets. Bounded Turing reducibilities are obtained from classical Turing reducibility by imposing upper bounds on the use functions (i.e., on the size of the oracle queries) of the reductions. The most popular bounded Turing reducibility which has been intensively studied ...
متن کاملNondeterministic Quantum Query and Quantum Communication Complexities
We study nondeterministic quantum algorithms for Boolean functions f. Such algorithms have positive acceptance probability on input x iff f (x) = 1. In the setting of query complexity, we show that the nondeterministic quantum complexity of a Boolean function is equal to its " nondeterministic polynomial " degree. We also prove a quantum-vs.-classical gap of 1 vs. n for nondeterministic query c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1989
ISSN: 0168-0072
DOI: 10.1016/0168-0072(89)90010-9